Section: New Software and Platforms

GF2X

Functional Description

GF2X is a software library for polynomial multiplication over the binary field, developed together with Richard Brent (Australian National University, Canberra, Australia). It holds state-of-the-art implementation of fast algorithms for this task, employing different algorithms in order to achieve efficiency from small to large operand sizes (Karatsuba and Toom-Cook variants, and eventually Schönhage's or Cantor's FFT-like algorithms). FG2X takes advantage of specific processor instructions (SSE, PCLMULQDQ).

• Participants: Pierrick Gaudry, Emmanuel Thomé and Paul Zimmermann

• Contact: Emmanuel Thomé

• URL: https://gforge.inria.fr/projects/gf2x/